Recovering Exact Results from Inexact Numerical Data in Algebraic Geometry

نویسندگان

  • Daniel J. Bates
  • Jonathan D. Hauenstein
  • Timothy M. McCoy
  • Chris Peterson
  • Andrew J. Sommese
چکیده

Let {f1, f2, . . . , ft} ⊂ Q[z1, . . . , zN ] be a set of homogeneous polynomials. Let Z denote the complex, projective, algebraic set determined by the homogeneous ideal I = (f1, f2, . . . , ft) ⊂ C[z1, . . . , zN ]. Numerical continuation-based methods can be used to produce arbitrary precision numerical approximations of generic points on each irreducible component of Z. Consider the prime decomposition √ I = ⋂ i Pi over Q[z1, . . . , zN ]. In this article, it is shown that these approximated generic points may be used in an effective manner to extract exact elements Gi,j ∈ Z[z1, . . . , zN ] from each Pi. A collection of examples and applications serve to illustrate the approach.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A package for exact kinetic data structures and sweepline algorithms

In this paper we present a package for implementing exact kinetic data structures built on objects which move along polynomial trajectories. We discuss how the package design was influenced by various considerations, including extensibility, support for multiple kinetic data structures, access to existing data structures and algorithms in CGAL, as well as debugging. Due to the similarity betwee...

متن کامل

Reliable Geometric Computations with Algebraic Primitives and Predicates

The problem of accurate and robust implementation of geometric algorithms has received considerable attention for more than a decade. Despite much progress in computational geometry and geometric modeling, practical implementations of geometric algorithms are prone to error. Much of the difficulty arises from the fact that reasoning about geometry most naturally occurs in the domain of the real...

متن کامل

A regularization approach for estimating the type of a plane curve singularity

We address the algebraic problem of analysing the local topology of each singularity of a plane complex algebraic curve defined by a squarefree polynomial with both exact (i.e. integers or rationals) and inexact data (i.e. numerical values). For the inexact data, we associate a positive real number that measures the noise in the coefficients. This problem is ill-posed in the sense that tiny cha...

متن کامل

Cleaning up the Tower: Numbers in Scheme

The R5RS specification of numerical operations leads to unportable and intransparent behavior of programs. Specifically, the notion of “exact/inexact numbers” and the misleading distinction between “real” and “rational” numbers are two primary sources of confusion. Consequently, the way R5RS organizes numbers is significantly less useful than it could be. Based on this diagnosis, we propose to ...

متن کامل

Inexact Kleinman-Newton Method for Riccati Equations

In this paper we consider the numerical solution of the algebraic Riccati equation using Newton's method. We propose an inexact variant which allows one control the number of the inner iterates used in an iterative solver for each Newton step. Conditions are given under which the monotonicity and global convergence result of Kleinman also hold for the inexact Newton iterates. Numerical results ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Experimental Mathematics

دوره 22  شماره 

صفحات  -

تاریخ انتشار 2013